Computationally and Algebraically Complex Finite Algebra Membership Problems
نویسنده
چکیده
Kalicki showed in [5] that both of these problems are decidable. Kalicki’s algorithm is obtained by using a fact that only a bounded number of identities has to be verified to decide whether a finite algebra belongs to a finitely generated variety. This approach to the problem turned out to be very inefficient. Bergman and Slutzki presented in [2] an algorithm that solves the universal membership problem (and so a membership problem for any given algebra) in 2-EXPTIME. Their algorithm attempts to build a homomorphism between a free algebra of an appropriate size and the candidate for a member of the variety. It establishes the best known upper
منابع مشابه
On dimension of a special subalgebra of derivations of nilpotent Lie algebras
Let $L$ be a Lie algebra, $mathrm{Der}(L)$ be the set of all derivations of $L$ and $mathrm{Der}_c(L)$ denote the set of all derivations $alphainmathrm{Der}(L)$ for which $alpha(x)in [x,L]:={[x,y]vert yin L}$ for all $xin L$. We obtain an upper bound for dimension of $mathrm{Der}_c(L)$ of the finite dimensional nilpotent Lie algebra $L$ over algebraically closed fields. Also, we classi...
متن کاملEla the Moore - Penrose Inverse of a Free Matrix
A matrix is free, or generic, if its nonzero entries are algebraically independent. Necessary and sufficient combinatorial conditions are presented for a complex free matrix to have a free Moore-Penrose inverse. These conditions extend previously known results for square, nonsingular free matrices. The result used to prove this characterization relates the combinatorial structure of a free matr...
متن کاملNEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کاملInterpreting Graph Colorability in Finite Semigroups
We show that a number of natural membership problems for classes associated with finite semigroups are computationally difficult. In particular, we construct a 55-element semigroup S such that the finite membership problem for the variety of semigroups generated by S interprets the graph 3-colorability problem.
متن کاملA Categorical Perspective on Qualitative Constraint Calculi
In the domain of qualitative constraint reasoning, a subfield of AI which has evolved in the last 25 years, a large number of calculi for efficient reasoning about space and time has been developed. Reasoning problems in such calculi are usually formulated as constraint satisfaction problems. For temporal and spatial reasoning, these problems often have infinite domains, which need to be abstra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 17 شماره
صفحات -
تاریخ انتشار 2007